/*
 * Copyright (C) 2001-2011 Jacek Sieka, arnetheduck on gmail point com
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */

#ifndef DCPLUSPLUS_DCPP_TASK_H
#define DCPLUSPLUS_DCPP_TASK_H

#include "Thread.h"

struct Task
{
	virtual ~Task() { }
	virtual void beforeExecute() { } // !SMT!-S
};

struct StringTask : public Task
{
	StringTask(const string& str_) : str(str_) { }
	const string str;
};

class TaskQueue
{
	public:
		typedef pair<uint8_t, unique_ptr<Task>> Pair;
		typedef vector<Pair> List;
		typedef List::const_iterator Iter;
		
		TaskQueue()
		{
		}
		
		~TaskQueue()
		{
			clear();
		}
		
		void add(uint8_t type, std::unique_ptr<Task> && data)
		{
			Lock l(cs);
			tasks.push_back(make_pair(type, move(data)));
		}
		void get(List& list)
		{
			Lock l(cs);
			swap(tasks, list);
			for (Iter i = list.begin(); i != list.end(); ++i) // !SMT!-S
				if (i->second)
					i->second->beforeExecute();
		}
		void clear()
		{
			Lock l(cs);
			List tmp;
			get(tmp);
		}
	private:
	
		TaskQueue(const TaskQueue&);
		TaskQueue& operator=(const TaskQueue&);
		
		CriticalSection cs;
		List tasks;
};

#endif
